Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
نویسندگان
چکیده
منابع مشابه
Using Lagrangean Relaxation to Minimize the ( Weighted ) Number of Late Jobs
This paper tackles the general single machine scheduling problem, where jobs have di erent release and due dates and the objective is to minimize the weighted number of late jobs. The notion of master sequence is rst introduced, i.e., a sequence that contains at least an optimal sequence of jobs on time. This master sequence is used to derive an original mixed-integer linear programming formula...
متن کاملGenetic algorithms to minimize the weighted number of late jobs on a single machine
The general one-machine scheduling problem is strongly NP-Hard when the objective is to minimize the weighted number of late jobs. Few methods exist to solve this problem. In an other paper, we developed a Lagrangean relaxation algorithm which gives good results on many instances. However, there is still room for improvement, and a metaheuristic might lead to better results. In this paper, we d...
متن کاملLagrangean Relaxation for Minimizing the Weighted Number of Late Jobs on Parallel Machines
This paper presents a Lagrangean relaxation approach for solving a parallel machine scheduling problem where the objective function is to minimize the weighted number of late jobs. The approach is an extension of an approach that has been successfully applied to the one-machine case. It is the first method that gives lower bounds to the problem when an exact solution cannot be found.
متن کاملMulti-agent scheduling on a single machine to minimize total weighted number of tardy jobs
We consider the feasibility model of multi-agent scheduling on a single machine, where each agent’s objective function is to minimize the total weighted number of tardy jobs. We show that the problem is strongly NP-complete in general. When the number of agents is fixed, we first show that the problem can be solved in pseudo-polynomial time for integral weights, and can be solved in polynomial ...
متن کاملScheduling jobs with release times preemptively on a single machine to minimize the number of late jobs
We give a direct combinatorial O(n logn) algorithm for minimizing the number of late jobs on a single machine when jobs have release times and preemptions are allowed. Our algorithm improves the earlier O(n) and O(n) dynamic programming algorithms for this problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Naval Research Logistics (NRL)
سال: 2002
ISSN: 0894-069X
DOI: 10.1002/nav.10056